Large subspaces of compositionally universal functions with maximal cluster sets
نویسندگان
چکیده
Let (φn) be a sequence of holomorphic self-maps of a Jordan domain G in the complex plane. Under appropriate conditions on (φn), we construct an H(G)-dense linear manifold –as well as a closed infinite-dimensional linear manifold– all of whose non-zero functions have H(G)-dense orbits under the action of the sequence of composition operators associated to (φn). Simultaneously, these functions also present maximal cluster sets along each member of a large class of curves in G tending to the boundary.
منابع مشابه
Certain subalgebras of Lipschitz algebras of infinitely differentiable functions and their maximal ideal spaces
We study an interesting class of Banach function algebras of innitely dierentiable functions onperfect, compact plane sets. These algebras were introduced by Honary and Mahyar in 1999, calledLipschitz algebras of innitely dierentiable functions and denoted by Lip(X;M; ), where X is aperfect, compact plane set, M = fMng1n=0 is a sequence of positive numbers such that M0 = 1 and(m+n)!Mm+n ( m!Mm)...
متن کاملMaximal elements of sub-topical functions with applications to global optimization
We study the support sets of sub-topical functions and investigate their maximal elements in order to establish a necessary and sufficient condition for the global minimum of the difference of two sub-topical functions.
متن کاملMaximal prehomogeneous subspaces on classical groups
Suppose $G$ is a split connected reductive orthogonal or symplectic group over an infinite field $F,$ $P=MN$ is a maximal parabolic subgroup of $G,$ $frak{n}$ is the Lie algebra of the unipotent radical $N.$ Under the adjoint action of its stabilizer in $M,$ every maximal prehomogeneous subspaces of $frak{n}$ is determined.
متن کاملInternational Workshop on Visual Data
Finding clusters on the basis of density distribution is a traditional approach to discover clusters with arbitrary shape. Some density-based clustering algorithms such as DBSCAN, OPTICS, DENCLUE, and CLIQUE etc have been explored in recent researches. This paper presents a new approach which is based on the ordered subspace to find clusters. The key idea is to sort the subspaces according to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 164 شماره
صفحات -
تاریخ انتشار 2012